Cryptographic Accumulators: Definitions, Constructions and Applications
نویسندگان
چکیده
After their first appearance in the cryptographic community ten years ago, cryptographic accumulators have received a discontinuous attention from the researchers of the field. Although occasionally studied, there has been no systematic effort to organize the knowledge of the subject, abstracting away from the unnecessary details of specific proposals, so as to provide a reliable starting point for further investigation. The goal of this paper is to present a complete picture of the topic, starting from the issue of defining an adequate formalization for cryptographic accumulators, and then moving on to a description of known constructions. A quick tour of interesting applications is then presented; finally, some possible lines for future development are suggested.
منابع مشابه
Real-World Performance of Cryptographic Accumulators
Cryptographic accumulators have often been proposed for use in security protocols, and the theoretical runtimes of algorithms using them have been shown to be reasonably efficient, but their performance in the real world has rarely been measured. In this paper I analyze the performance differences between two cryptographic accumulator constructions, RSA accumulators and bilinear-map accumulator...
متن کاملRevisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
Cryptographic accumulators allow to accumulate a finite set of values into a single succinct accumulator. For every accumulated value, one can efficiently compute a witness, which certifies its membership in the accumulator. However, it is computationally infeasible to find a witness for any nonaccumulated value. Since their introduction, various accumulator schemes for numerous practical appli...
متن کاملLogics for Reasoning about Cryptographic Constructions
We present two logical systems for reasoning about cryptographic constructions which are sound with respect to standard cryptographic definitions of security. Soundness of the first system is proved using techniques from nonstandard models of arithmetic. Soundness of the second system is proved by an interpretation into the first system. We also present examples of how these systems may be used...
متن کاملConstructing cryptographic definitions
This paper mirrors an invited talk to ISCISC 2011. It is not a conventional paper so much as an essay summarizing thoughts on a little-talked-about subject. My goal is to intermix some introspection about definitions with examples of them, these examples drawn mostly from cryptography. Underpinning our discussion are two themes. The first is that definitions are constructed. They are i...
متن کاملVolume Editor
This paper provides a comprehensive treatment of forwardsecurity in the context of shared-key based cryptographic primitives, as a practical means to mitigate the damage caused by key-exposure. We provide definitions of security, practical proven-secure constructions, and applications for the main primitives in this area. We identify forwardsecure pseudorandom bit generators as the central prim...
متن کامل